翻訳と辞書 |
E (complexity) : ウィキペディア英語版 | E (complexity) In computational complexity theory, the complexity class E is the set of decision problems that can be solved by a deterministic Turing machine in time 2O(n) and is therefore equal to the complexity class DTIME(2O(n)). E, unlike the similar class EXPTIME, is not closed under polynomial-time many-one reductions. == References ==
*. *. *. *. *.
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「E (complexity)」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|